Secured Relational Database Watermarking Using Genetic and Firefly Optimization Algorithms
نویسنده
چکیده
The information technology plays a vital role during the rapid growth of using information systems comprising relational data. Also, the relational information is important in many areas such as medical, military, forensics and stock market, where data should be distributed to users from a centralized database. The relational databases which is used in shared environment for extracting the information; inevitably they are susceptible to security threats concerning data tampering and ownership rights. The outsourcing data results in a number of threats such as alteration of data, deletion of data, accessing by unauthorized people, producing unauthorized copies. Recently, many methods are proposed to watermark databases to protect digital rights of owners. When the watermark is enforced on data for protecting ownership right, the data quality get compromised. For protecting the data quality a robust and reversible watermarking technique for numeric and non-numeric relational data is required. Particularly, watermarking techniques based on optimization draw attention, which results in improving watermark capacity and lower distortion. In this paper, A Robust Reversible Watermarking (RRW) with Genetic Algorithm (GA) and Firefly Algorithm (FFA) is proposed to embed watermark into relational databases. GA and FFA are optimization techniques which are biologically inspired. Best attribute values are selected efficiently by the FFA and later GA is used for creating the optimum watermark string which ensures reversibility without data quality loss. Experimental results indicate that FFA and GA have reduced complexity and results in improved watermark capacity and less distortion. Keywords— Reversible Digital Watermarking, Relational Database, Robustness, Genetic Algorithm, Firefly Optimization Algorithm.
منابع مشابه
Relational Databases Query Optimization using Hybrid Evolutionary Algorithm
Optimizing the database queries is one of hard research problems. Exhaustive search techniques like dynamic programming is suitable for queries with a few relations, but by increasing the number of relations in query, much use of memory and processing is needed, and the use of these methods is not suitable, so we have to use random and evolutionary methods. The use of evolutionary methods, beca...
متن کاملA Survey of Digital Image Watermarking Optimization based on Nature Inspired Algorithms NIAs
Nature-inspired algorithms (NIAs) have gained a significant popularity in recent years to tackle hard real world problems and solve complex optimization functions whose actual solution does not exist. Many new algorithms have been developed which show their capabilities almost in every aspect, where rapid solutions are needed. A survey of the NIAs that are used to find the optimal digital image...
متن کاملA Hybrid Grey based Two Steps Clustering and Firefly Algorithm for Portfolio Selection
Considering the concept of clustering, the main idea of the present study is based on the fact that all stocks for choosing and ranking will not be necessarily in one cluster. Taking the mentioned point into account, this study aims at offering a new methodology for making decisions concerning the formation of a portfolio of stocks in the stock market. To meet this end, Multiple-Criteria Decisi...
متن کاملIntelligent scalable image watermarking robust against progressive DWT-based compression using genetic algorithms
Image watermarking refers to the process of embedding an authentication message, called watermark, into the host image to uniquely identify the ownership. In this paper a novel, intelligent, scalable, robust wavelet-based watermarking approach is proposed. The proposed approach employs a genetic algorithm to find nearly optimal positions to insert watermark. The embedding positions coded as chr...
متن کاملA Hybrid Algorithm using Firefly, Genetic, and Local Search Algorithms
In this paper, a hybrid multi-objective algorithm consisting of features of genetic and firefly algorithms is presented. The algorithm starts with a set of fireflies (particles) that are randomly distributed in the solution space; these particles converge to the optimal solution of the problem during the evolutionary stages. Then, a local search plan is presented and implemented for searching s...
متن کامل